import sys
from math import gcd
def f(n):
s=str(n)
x=0
for i in range(len(s)):
x=x+int(s[i])
return x
for _ in range(int(sys.stdin.readline())):
n=int(sys.stdin.readline())
s1=f(n)
s2=f(n+1)
if gcd(s1,n)>1:
print(n)
elif gcd(s2,n+1)>1:
print(n+1)
else:
print(n+2)
/**
* author: Mohammed-issa
* created: 00.00.00
**/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long n;
cin >> n;
while (true) {
long long n2 = n;
int sum = 0;
while (n2 > 0) {
sum += n2 % 10;
n2 /= 10;
}
if (gcd(n, sum) > 1) {
cout << n << endl;
break;
}
n++;
}
}
}1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |